The distributed version of the Interval Geometric Machine Model ∗

نویسندگان

  • Renata H. S. Reiser
  • Antônio Carlos R. Costa
  • Felix da Cunha
چکیده

This paper presents a distributed version of the Interval Geometric Machine Model [4], called Distributed Interval Geometric Machine, whose inductive construction allows recursive definitions for interval algorithms involving possibly infinite distributed and synchronous parallel computations performed over array structures. The sequence of transfinite natural numbers [8] is considered in order to index the transfinite global memory of the Distributed Interval Geometric Machine Model, shared by synchronized processes distributed over an enumerable set of machine models, each operating on a part of such indexing. Let ξ = (ξn)n∈N be a possible infinite enumerable subset of points related to the multi-dimensional geometric space. In a finite approach, ξ = (ξ0, ξ1, . . . , ξn) denotes the canonical basis of the n-dimensional geometric space whose n-dimensional vectors are giving by (α0 , α1 , . . . , αn). In this case, memory values are taken from the set of real intervals, whose elements (a ∈ IR) are defined in the center-radius form ((ac, ar) ∈ R) and placed in the shared memory by the corresponding coordinates of the three-dimensional euclidian geometric space ((α0 , α1 , 0), (α0 , α1 , 1) ∈ R). The main characteristics of the coherence space D∞2 of distributed processes, inductively constructed from the coherence space D∞ introduced in [3], are described. Following the methodology proposed in [7], each level in the inductive construction of D∞2 is identified by a subspace D∞+m, which reconstructs all the objects from the level below it, preserving their properties and relation and building the new objects specific of this level. The constructive relationship between the levels is expressed by linear functions called embedding and projection functions, interpreting constructors and destructors of processes, respectively. In addition, the programming language L(D∞) [6, 5] is extended to model the semantics of simple distributed algorithms applied to Interval Mathematics [2], including sample examples of distributed programs related to interval arithmetics operations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bayes Estimation for a Simple Step-stress Model with Type-I Censored Data from the Geometric Distribution

This paper focuses on a Bayes inference model for a simple step-stress life test using Type-I censored sample in a discrete set-up. Assuming the failure times at each stress level are geometrically distributed, the Bayes estimation problem of the parameters of interest is investigated in the both of point and interval approaches. To derive the Bayesian point estimators, some various balanced lo...

متن کامل

Power Normal-Geometric Distribution: Model, Properties and Applications

In this paper, we introduce a new skewed distribution of which normal and power normal distributions are two special cases. This distribution is obtained by taking geometric maximum of independent identically distributed power normal random variables. We call this distribution as the power normal--geometric distribution. Some mathematical properties of the new distribution are presented. Maximu...

متن کامل

Maintenance management decision model for preventive maintenance strategy on production equipment

In industries, Preventive Maintenance (PM) is not a new practice to minimise the sudden breakdown of production machine. PM will be performed at predetermine intervals to provide a balance between failure cost and component utilisation (aging). However, most of PM interval is based on experience or original equipment manufacturer (OEM) recommendations. Consequently, the benefits from PM are not...

متن کامل

A Programming Language for the Interval Geometric Machine

This paper presents an interval version of the Geometric Machine Model (GMM) and the programming language induced by its structure. The GMM is an abstract machine model, based on Girard’s coherence space, capable of modelling sequential, alternative, parallel (synchronous) and non-deterministic computations on a (possibly infinite) shared memory. The processes of the GMM are inductively constru...

متن کامل

Entropy-based Consensus for Distributed Data Clustering

The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004